Jump to content

User:Netcse/Books/List of Data Structures

From Wikipedia, the free encyclopedia


List of Data Structures

[edit]

Wikibook Creator

[edit]
Data structure
Search data structure
Primitive data type
Boolean data type
Character (computing)
IEEE floating point
Double-precision floating-point format
Integer (computer science)
Enumerated type
Plain old data structure
Array data type
Record (computer science)
Union type
Tagged union
Variant type
Abstract data type
Container (abstract data type)
Associative array
Multimap
List (abstract data type)
Set (abstract data type)
Priority queue
Queue (abstract data type)
Double-ended queue
Stack (abstract data type)
String (computer science)
Graph (abstract data type)
Array data structure
Bidirectional map
Bit array
Bit field
Bitboard
Bitmap
Circular buffer
Control table
System image
Dynamic array
Gap buffer
Hashed array tree
Heightmap
Lookup table
Matrix (mathematics)
Parallel array
Sorted array
Sparse array
Sparse matrix
Iliffe vector
Variable-length array
Doubly linked list
Linked list
Self-organizing list
Skip list
Unrolled linked list
VList
XOR linked list
Zipper (data structure)
Doubly connected edge list
Difference list
AA tree
AVL tree
Binary search tree
Binary tree
Cartesian tree
Pagoda (data structure)
Treap
Red–black tree
Rope (data structure)
Scapegoat tree
Self-balancing binary search tree
Splay tree
T-tree
Tango tree
Threaded binary tree
Top tree
Weight-balanced tree
B-tree
B+ tree
Dancing tree
2–3 tree
2–3–4 tree
Queap
Fusion tree
Bx-tree
Heap (data structure)
Binary heap
Binomial heap
Fibonacci heap
AF-heap
2–3 heap
Soft heap
Pairing heap
Leftist tree
Beap
Skew heap
D-ary heap
Brodal queue
Tree (data structure)
Radix tree
Suffix tree
Suffix array
Compressed suffix array
FM-index
Generalized suffix tree
Judy array
C-treeACE
Ternary tree
K-ary tree
And–or tree
(a,b)-tree
Link/cut tree
SPQR tree
Spaghetti stack
Disjoint-set data structure
Enfilade (Xanadu)
Exponential tree
Fenwick tree
Van Emde Boas tree
Space partitioning
Segment tree
Interval tree
Range tree
Bin (computational geometry)
K-d tree
Implicit k-d tree
Min/max kd-tree
Adaptive k-d tree
Quadtree
Octree
Linear octree
Z-order curve
UB-tree
R-tree
R+ tree
R* tree
Hilbert R-tree
X-tree
Metric tree
Cover tree
M-tree
Vantage-point tree
BK-tree
Bounding interval hierarchy
Rapidly exploring random tree
Abstract syntax tree
Parse tree
Decision tree
Alternating decision tree
Minimax
Expectiminimax tree
Finger tree
Binary expression tree
Bloom filter
Count–min sketch
Distributed hash table
Double hashing
Dynamic perfect hashing
Hash array mapped trie
Hash list
Hash table
Hash tree
Hash trie
Koorde
Prefix hash tree
Rolling hash
MinHash
Ctrie
Adjacency list
Adjacency matrix
Graph-structured stack
Scene graph
Binary decision diagram
Zero-suppressed decision diagram
And-inverter graph
Directed graph
Directed acyclic graph
Propositional directed acyclic graph
Multigraph
Hypergraph
Lightmap
Winged edge
Quad-edge
Routing table
Symbol table
Collection (abstract data type)
Double-ended priority queue